Comparison of Overapproximation

نویسندگان

  • Nathan van de Wouw
  • Rob H. Gielen
  • Laurentiu Hetel
  • Sorin Olaru
  • Mircea Lazar
  • Jamal Daafouz
  • Silviu Niculescu
چکیده

The presence of a communication network in a control loop induces many imperfections such as varying transmission delays, varying sampling/transmission intervals and packet loss, which can degrade the control performance significantly and can even lead to instability. Various techniques have been proposed in the literature for stability analysis and controller design for these so-called networked control systems (NCSs). The goal of this paper is to survey a particular class of techniques using discrete-time models that are based on polytopic overapproximations of the uncertain NCS model and lead to stability conditions in terms of linear matrix inequalities (LMIs). We discuss the advantages and disadvantages of the existing techniques in both qualitative and quantitative manners. In particular, we apply all methods to a benchmark example providing a numerical comparison of the methods with respect to conservatism as well as numerical complexity. ∗Maurice Heemels, Nathan van de Wouw and Tijs Donkers are supported by the European Community through the FP7-ICT-2007-2 thematic programme under the WIDE224168 project. Jamal Daafouz is supported by the ANR project ArHyCo, ARPEGE, number ANR-2008 SEGI 004. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. HSCC’10, April 12–15, 2010, Stockholm, Sweden. Copyright 2010 ACM 978-1-60558-955-8/10/04 ...$10.00.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the relationships between models in protocol verification

We formally investigate the relationship between several models that are widely used in protocol verification, namely variants of the inductive model of message traces inspired by Paulson’s approach, and models based on rewriting. More precisely, we prove several overapproximation relationships between models, i.e. that one model allows strictly more traces or reachable states than the other. T...

متن کامل

Embracing Overapproximation for Proving Nontermination

One of the most fundamental program properties is termination: a program’s execution will end regardless of its input. Bugs due to nontermination of a subroutine can be a nuisance, particularly since they cannot reliably be detected by testing. Although termination is undecidable, in practice we can use incomplete but effective methods to prove termination. However, failure to find a terminatio...

متن کامل

SPolly: Speculative Optimizations in the Polyhedral Model

The polyhedral model is only applicable to code regions that form static control parts (SCoPs) or slight extensions thereof. To apply polyhedral techniques to a piece of code, the compiler usually checks, by static analysis, whether all SCoP conditions are fulfilled. However, in many codes, the compiler fails to verify that this is the case. In this paper we investigate the rejection causes as ...

متن کامل

Coordinate Descent with Arbitrary Sampling II: Expected Separable Overapproximation

The design and complexity analysis of randomized coordinate descent methods, and in particular of variants which update a random subset (sampling) of coordinates in each iteration, depends on the notion of expected separable overapproximation (ESO). This refers to an inequality involving the objective function and the sampling, capturing in a compact way certain smoothness properties of the fun...

متن کامل

A Forward-Backward Abstraction Refinement Algorithm

Abstraction refinement-based model checking has become a standard approach for efficiently verifying safety properties of hardware/software systems. Abstraction refinement algorithms can be guided by counterexamples generated from abstract transition systems or by fixpoints computed in abstract domains. Cousot, Ganty and Raskin recently put forward a new fixpoint-guided abstraction refinement a...

متن کامل

Interpolant based Decision Procedure for Quantifier-Free Presburger Arithmetic

Recently, off-the-shelf Boolean SAT solvers have been used to construct ground decision procedures for various theories, including Quantifier-Free Presburger (QFP) arithmetic. One such approach (often called the eager approach) is based on a satisfiability-preserving translation to a Boolean formula. Eager approaches are usually based on encoding integers as bit-vectors and suffer from the loss...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010